MULTIFRONTAL VS FRONTAL TECHNIQUES FOR ‘i. - CHEMICAL PROCESS SIMULATION ON ,. SUPERCOMPUTERS
نویسنده
چکیده
A critical computational step in large-scale process simulation using rigorous equation-based models is the solution of a sparse linear equation system. Traditional sparse solvers based on indirect addressing are not effective on supercomputers because they do not vectorize well. By relying on vectorized dense matrix kernels, the multifrontal and frontal methods provide much better performance, as demonstrated using several examples. These examples are also used to compare the performance of frontal and multifrontal solvers. On problems with good initial matrix orderings the frontal method is most effective, while without a good initial ordering the multifrontal method is attractive. INTRODUCTION . . Steady-state or dynamic simulation tools are widely used in the design, optimization, and operation of chemical processes. Increasingly these tools are being used industrially in very large-scale, plantwide studies based on rigorous physical and chemical models. These trends have been made possible by impressive gains in computer performance and advances in numerical methods. Leading the way, modem supercomputers offer vector and parallel processing architectures for solving problems that, until now, could not be solved with other computational tools. Today, this leading-edge technology is increasingly seen at price levels that make it more widely available to process systems engineers. Thus, the use of supercomputer technolpgy in process simulation is more practicable than ever before, and provides opportunities to solve larger-scale and more realistic plant models than ever before. However, since most current methods for solving process simulation problems were developed for use on conventional serial machines, they usually do not effectively take advantage of the vector and parallel processing architecture of supercomputers. Thus, to exploit supercomputing (as opposed to just using a supercomputer) requires the rethinking of the solution strategies used in process simulation. In this t To whom all correspondence should be addressed. (Fax: 217-244-8068; Internet: [email protected]). Presented at Fifth International Symposium on Process Systems Engineering (PSE ‘94), Kyongju, Korea, 30 May-3 June, 1994. paper, we consider the sparse linear equation solving strategies used in this context.
منابع مشابه
Multifrontal Techniques for Chemical Process Simulation on Supercomputers
A critical computational step in large-scale process simulation using rigorous equationbased models is the solution of a sparse linear equation system. Traditional sparse solvers based on indirect addressing are not effective on supercomputers because they do not vectorize well. By relying on vectorized dense matrix kernels, the multifrontal and frontal methods provide much better performance, ...
متن کاملComputational Strategies for Chemical Process Engineering Using Parallel/Vector Supercomputers
In this article we consider strategies for exploiting supercomputer technology in solving the sparse matrix problems arising in process simulation and optimization. A new multifrontal solver for use in simulating equilibrium-stage processes and a new parallel frontal solver for large-grained parallel solution of process simulation and optimization problems are described. Results for several pro...
متن کاملA Multifrontal Approach for Simulating Equilibrium-Stage Processes on Supercomputers
For the simulation of complex equilibrium-stage operations, the overall computing time is often dominated by the solution of large, sparse systems of linear equations. If the modeling equations for such separation systems are grouped by equilibrium stage, the linear systems take on an almost banded form with relatively few o -band elements. We present here a simple multifrontal approach for sol...
متن کاملA Parallel Block Frontal Solver For Large Scale Process Simulation: Reordering Effects
For the simulation and optimization of large-scale chemical processes, the overall computing time is often dominated by the time needed to solve a large sparse system of linear equations. We describe here a parallel frontal solver which can significantly reduce the wallclock time required to solve these linear equation systems using parallel/vector supercomputers. The algorithm exploits both mu...
متن کاملMatrix Reordering E ects on a Parallel Frontal Solver for Large Scale Process Simulation
For the simulation and optimization of large scale chemical processes, the overall computing time is often dominated by the time needed to solve a large sparse system of linear equations. A parallel frontal solver can be used to signi cantly reduce the wallclock time required to solve these linear equation systems using parallel/vector supercomputers. This is done by exploiting both multiproces...
متن کامل